Symbolic model checking for µ-calculus requires exponential time

نویسنده

  • Alexander Moshe Rabinovich
چکیده

Model checking [3] is a very popular paradigm for automatic verification of properties of finite state systems like those defined by circuits or communication protocols. A system is interpreted as a finite state labeled transition system or equivalently as a finite Kripke structure. If sys contains k concurrent components, each with m states, then the Kripke structure described by sys may have m states. Hence, the size of the Kripke structure might be exponential in the size m × k of its description. This phenomenon is known as the state explosion problem. To avoid the state explosion, a method called symbolic model checking was proposed in [12]. This method avoids building a state graph by using propositional formulas to represent sets and relations. Required properties of a system are formulated by formulas in temporal or modal formalisms like LTL, CTL, CTL or μ-calculus (see surveys [4, 14]). The μ-calculus [10] is a powerful language for expressing properties of Kripke structures by using the least fixed point operator. It provides a single, uniform and elegant framework subsuming most temporal and modal logics of programs [5]. In this paper we investigate the complexity of the following decision problem. Symbolic Model Checking for μ-calculus: Input: A description of a finite state Kripke structure K and its state s by propositional formulas, and a μ-calculus formula φ. Question: Determine whether the state s of the Kripke structure K satisfies the property defined by φ. Notice that the size of an instance of the model checking problem is the size of the description of K, s, plus the size of φ. This is a natural measurement. Indeed, in order to verify a circuit with 1000 Flip-Flops, a model checker will be provided with the graph of the circuit rather than with its state transition

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Measured Collapse of the Modal µ-Calculus Alternation Hierarchy

The μ-calculus model-checking problem has been of great interest in the context of concurrent programs. Beyond the need to use symbolic methods in order to cope with the state-explosion problem, which is acute in concurrent settings, several concurrency related problems are naturally solved by evaluation of μ-calculus formulas. The complexity of a naive algorithm for model checking a μ-calculus...

متن کامل

Enriched µ-Calculi Module Checking

The model checking problem for open systems has been widely studied in the literature, for both finite–state (module checking) and infinite–state (pushdown module checking) systems, with respect to CTL and CTL. In this paper, we further investigate this problem with respect to the μ-calculus enriched with nominals and graded modalities (hybrid graded μ-calculus), in both the finite–state and in...

متن کامل

Distributed Symbolic Model Checking for µ-Calculus

In this paper we propose a distributed symbolic algorithm for model checking of propositional μ–calculus formulas. μ-calculus is a powerful formalism and many problems like (fair) CTL and LTL model checking can be solved using the μ–calculus model checking. Previous works on distributed symbolic model checking were restricted to reachability analysis and safety properties. This work thus signi£...

متن کامل

Enriched µ-Calculus Pushdown Module Checking

The model checking problem for open systems (called module checking) has been intensively studied in the literature, both for finite–state and infinite–state systems. In this paper, we focus on pushdown module checking with respect to decidable fragments of the fully enriched μ–calculus. We recall that finite–state module checking with respect to fully enriched μ–calculus is undecidable and hen...

متن کامل

An Effective Tableau System for the Linear Time µ-Calculus

We present a tableau system for the model checking problem of the linear time /*-calculus. It improves the system of Stifling and Walker by simplifying the success condition for a tableau. In our system success for a leaf is determined by the path leading to it, whereas Stifling and Walker's method requires the examination of a potentially infinite number of paths extending over the whole tableau.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 243  شماره 

صفحات  -

تاریخ انتشار 2000